Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
401	Tight Bounds for Asynchronous Renaming1 DAN ALISTARH, Microsoft Research Cambridge JAMES ASPNES2 , Yale KEREN CENSOR-HILLEL3 , Technion SETH GILBERT4 , National University of Singapore RACHID GUERRAOUI, EPFL Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Analysis of algorithms Algorithm Time complexity Randomized algorithm Adversary model Consensus Distributed computing Complexity Quantum algorithm Theoretical computer science Applied mathematics Computational complexity theory
402	Project Summary The design and analysis of network algorithmics solutions is a rich area of research that has led to numerous successful deployments in commercial Internet routers and network monitoring appliances. In ge Add to Reading List Source URL: www.cc.gatech.edu Language: English - Date: 2014-03-25 14:56:33 Computational complexity theory Cybernetics Formal sciences Computer science Best worst and average case Stochastic Algorithm Control theory Applied mathematics Mathematics Analysis of algorithms
403	Stochastic Streams: Sample Complexity vs. Space Complexity Michael Crouch1 , Andrew McGregor∗1 , and David Woodruff2 1 University of Massachusetts at Amherst Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2013-09-17 12:26:23 Stochastic processes Connectivity Random walk SL Network theory Networks Randomized algorithm Centrality Theoretical computer science Computational complexity theory Applied mathematics
404	Microsoft PowerPoint - shortest-path-summary Add to Reading List Source URL: www.cse.unr.edu Language: English - Date: 2012-12-20 19:29:20 Network theory Computational complexity theory Shortest path problem Algorithm Approximation algorithm Streaming algorithm Fast Fourier transform Theoretical computer science Mathematics Applied mathematics
405	Course Information Sheet Course: BMGT 831 (Network Optimization) Add to Reading List Source URL: www.amsc.umd.edu Language: English - Date: 2010-10-25 17:36:24 Operations research NP-complete problems Academia Mathematical optimization Combinatorial optimization Computational complexity theory Shortest path problem Academic dishonesty Travelling salesman problem Theoretical computer science Applied mathematics Mathematics
406	The Complexity of Renaming Dan Alistarh EPFL James Aspnes Yale Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2015-04-30 10:33:59 Computer science Algorithm Randomized algorithm Time complexity Adversary model Asymptotically optimal algorithm Quantum algorithm Computational complexity theory Theoretical computer science Applied mathematics Analysis of algorithms
407	Microsoft PowerPoint - Broadbent-QOTP-Paris-for-posting.pptx Add to Reading List Source URL: www.pcqc.fr Language: English - Date: 2015-04-05 22:49:05 Physics Security token Quantum channel Quantum cryptography Cryptography Computational complexity theory Theoretical computer science Applied mathematics Quantum information science
408	work (5). A contact network is a directed graph with a single special source s and a single special sink t. Each edge is labeled with either x or 2, where x is some variahle. Given any assignment of values to the variabl Add to Reading List Source URL: binds.cs.umass.edu Language: English - Date: 2014-12-01 15:40:28 Computability theory Turing machine Alan Turing Models of computation Hypercomputation Computability Computational complexity theory Church–Turing thesis Hava Siegelmann Theoretical computer science Computer science Theory of computation
409	Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:35:48 NP-complete problems Graph coloring Graph theory Analysis of algorithms Complexity classes Randomized algorithm Distributed computing Minimum spanning tree SL Theoretical computer science Computational complexity theory Mathematics
410	Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic Viktor Kuncak1 and Martin Rinard2 1 Ecole Politechnique F´ed´erale de Lausanne, Lausanne, VD, Switzerland Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2007-12-05 11:59:40 Logic in computer science Model theory Complexity classes Boolean algebra Electronic design automation Boolean satisfiability problem Presburger arithmetic Quantifier elimination Decision problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE